Functional first order definability of LRTp

The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable rst order relations in the sense of Brattka are denable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are denable in the language. This paper is an expanded version of [12] in which we show that the non-deterministic version of the limit operator, which allows to dene all computable rst order relations, when restricted to single-valued total inputs, produces single-valued total outputs. This implies that not only the polynomials are denable in the language but also allcomputable rst order functions

Reversibility for Quantum Programming Language QML

We present an extension of the denotational semantic model of the quantum programming language QML, to which computational reversibility is incorporated. The semantics of QML is defined in a functional setting which consider classical and quantum data, to which we add inverse functions. Additionally we incorporate into the semantics a history track which allows reversibility in QML. From the generation and processing of the history track and the final result of a program, the rules for executing reversibility allow to compute the original input data. This work contributes to the study of reversibility in quantum programming languages and considering that there is not yet a quantum computer in which the language can be implemented, this history and the proposed inverse functions are not trivial and allows us to determine that this language is reversible

A New Optimization Strategy for Solving the Fall-Off Boundary Value Problem in Pixel-Value Di®erencing Steganography

In Digital Image Steganography, Pixel-Value Di®erencing (PVD) methods use the di®erence between neighboring pixel values to determine the amount of data bits to be inserted. The main advantage of these methods is the size of input data that an image can hold. However, the fall- o® boundary problem and the fall in error problem are persistent in many PVD steganographic methods. This results in an incorrect output image. To ¯x these issues, usually the pixel values are either somehow adjusted or simply not considered to carry part of the input data. In this paper, we enhance the Tri-way Pixel-Value Di®erencing method by ¯nding an optimal pixel value for each pixel pair such that it carries the maximum input data possible without ignoring any pair and without yielding incorrect pixel values

Electrochemical Mineralization of Ibuprofen on BDD Electrodes in an Electrochemical Flow Reactor: Numerical Optimization Approach

Statistical analysis was applied to optimize the electrochemical mineralization of ibuprofen with two boron-doped diamond (BDD) electrodes in a continuous electrochemical flow reactor under recirculation batch mode. A central composite rotatable (CCR) experimental design was used to analyze the e ect of initial pH (2.95–13.04), current intensity (2.66–4.34 A), and volumetric flow rate (0.16–1.84 L/min) and further optimized by response surface methodology (RSM) to obtain the maximum mineralization e ciency and the minimum specific energy consumption. A 91.6% mineralization e ciency (EM) of ibuprofen with a specific energy consumption (EC) of 4.36 KW h/g TOC within 7 h of treatment was achieved using the optimized operating parameters (pH0 = 12.29, I = 3.26 A, and Q of 1 L/min). Experimental results of RSM were fitted via a third-degree polynomial regression equation having the performance index determination coe cients (R2) of 0.8658 and 0.8468 for the EM and EC, respectively. The reduced root-mean-square error (RMSE) was 0.1038 and 0.1918 for EM and EC, respectively. This indicates an e cient predictive performance to optimize the operating parameters of the electrochemical flow reactor with desirability of 0.9999993. Besides, it was concluded that the optimized conditions allow to achieve a high percentage of ibuprofen mineralization (91.6%) and a cost of 0.002 USD $/L. Therefore, the assessed process is e cient for wastewater remediation.CONACyT (791495 y 740588

Extremsl Polygonal Arrays for the Merrifield-Simmons Index

For any polygonal array, independently of the number of sides on each polygon the zig-zag polygonal array has the extremal minimum value for the Merrifield-Simmons index. This result generalises a well known fact obtained for hexagonal chains

Extremsl Polygonal Arrays for the Merrifield-Simmons Index

For any polygonal array, independently of the number of sides on each polygon the zig-zag polygonal array has the extremal minimum value for the Merrifield-Simmons index. This result generalises a well known fact obtained for hexagonal chains

Comparing Implementations of a Calculator for Exact Real Number Computation

"Al ser uno de los primeros lenguajes de programación teóricos para el cómputo con números reales, Real PCF demostró ser impráctico debido a los constructores paralelos que necesita para el cálculo de funciones básicas. Posteriormente, se propuso LRT com

Comparando implementaciones de una calculadora para la computación de números reales exactos

As one of the first theoretical programming languages for exact real number computation, Real PCF was shown to be impractical due to the parallel construct needed for even basic operations. Later, LRT was proposed as a variant of Real PCF avoiding the parallelism by introducing a non-deterministic constructor into the language. In this paper we present an implementation of a calculator for exact real number computation based on LRT and compare its efficacy with an application of the standard use of real numbers in an imperative programming language. Finally, our implementation is compared with a standard implementation of exact real number computation based on the sign digit representation, which is also based on exact real number computation.Al ser uno de los primeros lenguajes de programación teóricos para el cómputo con números reales, Real PCF demostró ser impráctico debido a los constructores paralelos que necesita para el cálculo de funciones básicas. Posteriormente, se propuso LRT como una variante de Real PCF el cual evita el uso de constructores paralelos introduciendo un constructor no determinista dentro del lenguaje. En este artículo se presenta la implementación de una calculadora para el cómputo con números reales exactos basada en LRT y se compara su eficacia con una aplicación de números reales estándar en un lenguaje de programación imperativo. Finalmente, la implementación se compara con una implementación estándar de computación de números reales exactos, basada en la representación de dígitos con signo, que a su vez se basa sobre la computación de números reales exactos

lanComparing Implementations of a Calculator for Exact Real Number Computation

As one of the first theoretical programming languages for exact real number computation, Real PCF was shown to be impractical due to the parallel construct needed for even basic operations. Later, LRT was proposed as a variant of Real PCF avoiding the parallelism by introducing a non-deterministic constructor into the language. In this paper we present an implementation of a calculator for exact real number computation based on LRT and compare its efficacy with an application of the standard use of real numbers in an imperative programming language. Finally, our implementation is compared with a standard implementation of exact real number computation based on the sign digit representation, which is also based on exact real number computation.Al ser uno de los primeros lenguajes de programación teóricos para el cómputo con números reales, Real PCF demostró ser impráctico debido a los constructores paralelos que necesita para el cálculo de funciones básicas. Posteriormente, se propuso LRT como una variante de Real PCF el cual evita el uso de constructores paralelos introduciendo un constructor no determinista dentro del lenguaje. En este artículo se presenta la implementación de una calculadora para el cómputo con números reales exactos basada en LRT y se compara su eficacia con una aplicación de números reales estándar en un lenguaje de programación imperativo. Finalmente, la implementación se compara con una implementación estándar de computación de números reales exactos, basada en la representación de dígitos con signo, que a su vez se basa sobre la computación de números reales exactos

Exteding Extremal Polygonal Arrays for the Meriifield-Simmons Index

Polygonal array graphs have been widely investigated, and they represent a relevant area of interest in mathematical chemistry because they have been used to study intrinsic properties of molecular graphs. For example, to determine the Merrifield-Simmons index of a polygonal array An that is the number of independent sets of that graph, denoted as i(An)